Fast Tree-Based Redistancing forLevel Set Computations
نویسنده
چکیده
Level set methods for moving interface problems require efficient techniques for transforming an interface to a globally defined function whose zero set is the interface, such as the signed distance to the interface. This paper presents efficient algorithms for this “redistancing” problem. The algorithms use quadtrees and triangulation to compute global approximate signed distance functions. A quadtree mesh is built to resolve the interface and the vertex distances are evaluated exactly with a robust search strategy to provide both continuous and discontinuous interpolants. Given a polygonal interface with N elements, our algorithms run in O(N ) space and O(N log N ) time. Two-dimensional numerical results show they are highly efficient in practice. c © 1999 Academic Press
منابع مشابه
Accelerated redistancing for level set-based process simulations with the fast iterative method
The finite iterative method is compared to an industry-hardened fast marching method for accelerating the redistancing step essential for Level Set-based process simulations in the area of technology computer-aided design. We discuss our implementation of the finite iterative method and depict extensions to improve the method for process simulations, in particular regarding stability. Contrary ...
متن کاملA geometric mass-preserving redistancing scheme for the level set function
In this paper we describe and evaluate a geometric mass-preserving redistancing procedure for the level set function on general structured grids. The proposed algorithm is adapted from a recent finite element-based method and preserves the mass by means of a localized mass correction. A salient feature of the scheme is the absence of adjustable parameters. The algorithm is tested in two and thr...
متن کاملA Finite Element Level Set Redistancing Method Based on Gradient Recovery
We introduce a new redistancing method for level set functions. This method applies in a finite element setting and uses a gradient recovery technique. Based on the recovered gradient a quasi-normal field on the zero level of the finite element level set function is defined and from this an approximate signed distance function is determined. For this redistancing method rigorous error bounds ar...
متن کاملA New Mass-conserving Algorithm for Level Set Redistancing on Unstructured Meshes
Abstract. The Level Set Method is becoming increasingly popular for the simulation of several problems that involve interfaces. The level set function is advected by some velocity field, with the zero-level set of the function defining the position of the interface.The advection distorts the initial shape of the level set function, which needs to be re-initialized to a smooth function preservin...
متن کاملRedistancing by flow of time dependent eikonal equation
Construction of signed distance to a given interface is a topic of special interest to level set methods. There are currently, however, few algorithms that can efficiently produce highly accurate solutions. We introduce an algorithm for constructing an approximate signed distance function through manipulation of values calculated from flow of time dependent eikonal equations. We provide operati...
متن کامل